A Time-Efficient and Exploratory Algorithm for the Rectangle Packing Problem

Today, resource waste is considered as one of the most important challenges in different industries. In this regard, Rectangle Packing Problem (RPP) can affect noticeably both time and design issues businesses. study, main objective to create a set non-overlapping rectangles so that they have specific dimensions within rectangular plate with specified width an unlimited height. The ensued challenge NP-complete problem. problem, any class computational problems still there are no efficient solution for them. Most substantial computer-science such traveling salesman satisfiability (sometimes called propositional problem abbreviated SAT or B-SAT), graph-covering belong class. Essentially, it complicated spot best arrangement highest rate utilization by emphasizing linear computation time. This study introduces time-efficient exploratory algorithm RPP, including lowest front-line strategy Best-Fit algorithm. obtained results confirmed proposed lead good performance simplicity efficiency. Our evaluation shows model about 94.37% outperforms others 87.75%, 50.54%, 87.17% rate, respectively. Consequently, method capable achieving much better comparison other mentioned algorithms just 0.023 s running-time, which faster than others.